PrivGenDB: Efficient and privacy-preserving query executions over encrypted SNP-Phenotype database
نویسندگان
چکیده
Privacy and security issues limit the query executions over genomics datasets, notably single nucleotide polymorphisms (SNPs), raised by sensitivity of this type data. Therefore, it is important to ensure that executing queries on these datasets do not reveal sensitive information, such as identity individuals their genetic traits, a data server. In paper, we propose present novel model, call PrivGenDB, confidentiality SNP-phenotype while queries. The in PrivGenDB enabled its system architecture search functionality provided searchable symmetric encryption (SSE). To best our knowledge, construction first SSE-based approach ensuring current approaches for genomic are limited only substring range sequence Besides, new encoding mechanism proposed incorporated model. This enables handle dataset containing both genotype phenotype also support storing managing other metadata, like gender ethnicity, privately. Furthermore, different queries, namely Count, Boolean, Negation k′-out-of-k match used analysis, supported executed PrivGenDB. execution efficient scalable biomedical research services. These demonstrated analytical empirical analysis presented paper. Specifically, studies with 5000 entries (records) 1000 SNPs demonstrate count/Boolean 40 take approximately 4.3s 86.4μs, respectively, outperforming existing schemes.
منابع مشابه
Privacy-Preserving Complex Query Evaluation over Semantically Secure Encrypted Data
In the last decade, several techniques have been proposed to evaluate different types of queries (e.g., range and aggregate queries) over encrypted data in a privacy-preserving manner. However, solutions supporting the privacypreserving evaluation of complex queries over encrypted data have been developed only recently. Such recent techniques, however, are either insecure or not feasible for pr...
متن کاملPrivacy Preserving Range Query Search over Encrypted Numeric Data in Cloud
In cloud computing, to protect privacy when outsourcing database management systems, confidential data (e.g., bank account balance) has to be encrypted which however renders traditional query processing methods (e.g., the B-tree index) inapplicable. In this thesis, we consider processing range query search (e.g., retrieving all records with a bank account balance being less than some threshold)...
متن کاملAn Efficient and Privacy-Preserving Semantic Multi-Keyword Ranked Search over Encrypted Cloud Data
As so much advantage of cloud computing, more and more data owners centralize their sensitive data into the cloud. With a mass of data files stored in the cloud server, it is important to provide keyword based search service to data user. However, in order to protect the data privacy, sensitive data is usually encrypted before outsourced to the cloud server, which makes the search technologies ...
متن کاملPrivacy Preserving Ranked Keyword Search over Encrypted Cloud Data
We present a scheme that discusses secure rank based keyword search over an encrypted cloud data. The data that has to be outsourced is encrypted using symmetric encryption algorithm for data confidentiality. The index file of the keyword set that has to be searched is outsourced to the local trusted server where the keyword set that is generated from the data files is also stored. This is done...
متن کاملPrivacy Preserving Keyword Search over Encrypted Cloud Data
Cloud computing enables the organizations to outsource their data by providing a service model called infrastructure as a service (IaaS). In a public cloud the infrastructure is owned and managed by a cloud service provider and is located in the provider’s control. To protect the privacy of sensitive data, documents have to be encrypted before outsourcing. When the number of encrypted documents...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Informatics in Medicine Unlocked
سال: 2022
ISSN: ['2352-9148']
DOI: https://doi.org/10.1016/j.imu.2022.100988